Generating Compact MTBDD-Representations from ProbmelaSpecifications
نویسندگان
چکیده
The purpose of the paper is to provide an automatic transformation of parallel programs of an imperative probabilistic guarded command language (called Probmela) into probabilistic reactive module specifications. The latter serve as basis for the input language of the symbolic MTBDD-based probabilistic model checker PRISM, while Probmela is the modeling language of the model checker LiQuor which relies on an enumerative approach and supports partial order reduction and other reduction techniques. By providing the link between the model checkers PRISM and LiQuor, our translation supports comparative studies of different verification paradigms and can serve to use the (more comfortable) guarded command language for a MTBDD-based quantitative analysis. The challenges were (1) to ensure that the translation preserves the Markov decision process semantics, (2) the efficiency of the translation and (3) the compactness of the symbolic BDD-representation of the generated PRISM-language specifications.
منابع مشابه
Generating compact MBTDD-representations from Probmela specifications
The purpose of the paper is to provide an automatic transformation of parallel programs of an imperative probabilistic guarded command language (called Probmela) into probabilistic reactive module specifications. The latter serve as basis for the input language of the symbolic MTBDD-based probabilistic model checker PRISM, while Probmela is the modeling language of the model checker LiQuor whic...
متن کاملSplit Multi-terminal Binary Decision Diagrams
A new data structure called Split Multi-terminal Binary Decision Diagrams (Split MTBDD) is introduced for representing Multi–Output logic Functions (MOF). Split MTBDDs are efficient for some functions where conventional BDDs are not. A Split MTBDD comprises interconnected MTBDD components, each associated with a “dichotomic fragment”. The “dichotomy” reflects cognitive patterns introduced by th...
متن کاملCASPA: A Tool for Symbolic Performance and Dependability Evaluation
Symbolic data structures, such as binary decision diagrams (BDD) [1] and variants thereof have proved to be suitable for the efficient generation and compact representation of very large state spaces and transition systems. The key to such compact representation is the exploitation of the compositional structure of a given specification [2], [3]. It is also known that in addition to functional ...
متن کاملRepresentations of Double Coset Lie Hypergroups
We study the double cosets of a Lie group by a compact Lie subgroup. We show that a Weil formula holds for double coset Lie hypergroups and show that certain representations of the Lie group lift to representations of the double coset Lie hypergroup. We characterize smooth (analytic) vectors of these lifted representations.
متن کاملLinear Decision Diagrams∗
We introduce linear decision diagrams (LDDs) as a special class of linear representations of formal power series. LDDs can be seen as a generalization of some previously proposed structures, such as MTBDDs and matrix diagrams, that have seen successful application in the compact representation of Markov models with large state spaces. Besides providing some possibilities for additional compress...
متن کامل